Adaptable choosability of planar graphs with sparse short cycles
نویسندگان
چکیده
منابع مشابه
Adaptable choosability of planar graphs with sparse short cycles
Given a (possibly improper) edge-colouring F of a graph G, a vertex colouring of G is adapted to F if no colour appears at the same time on an edge and on its two endpoints. A graph G is called adaptably k-choosable (for some positive integer k) if for any list assignment L to the vertices of G, with |L(v)| ≥ k for all v, and any edge-colouring F of G, G admits a colouring c adapted to F where ...
متن کاملGroup edge choosability of planar graphs without adjacent short cycles
In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent short cycles is group (∆(G) + 1)-edgechoosable while some planar graphs with large girth and maximum degree is group ∆(G)-edge-choosable.
متن کاملChoosability and edge choosability of planar graphs without five cycles
It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)h c oosable. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Choosability, Edge choosability, Degeneracy, Planar graph.
متن کاملOn Choosability with Separation of Planar Graphs with Forbidden Cycles
We study choosability with separation which is a constrained version of list coloring of graphs. A (k, d)-list assignment L of a graph G is a function that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at most d colors. A graph G is (k, d)-choosable if there exists an L-coloring of G for every (k, d)-list assignment L. This...
متن کاملChoosability of toroidal graphs without short cycles
Let G be a toroidal graph without cycles of a fixed length k, and l (G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant number: CUHK4165/01E (to L. C.); Contract grant sponsor: NSFC; Contract grant number: 10771197 (to W. W.); Contract grant sponsor: ZJNSFC; Contract grant number: Z6090150 (to W. W.); Contract grant sponsor: NSC97-2115...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.05.004